Packing closed trails into dense graphs
نویسنده
چکیده
It has been shown [Balister, 2001] that if n is odd and m1, . . . , mt are integers with mi ≥ 3 and ∑t i=1 mi = |E(Kn)| then Kn can be decomposed as an edge-disjoint union of closed trails of lengths m1, . . . , mt. Here we show that the corresponding result is also true for any sufficiently large and sufficiently dense even graph G.
منابع مشابه
Packing Digraphs With Directed Closed Trails
It has been shown [Balister, 2001] that if n is odd and m1, . . . , mt are integers with mi ≥ 3 and ∑t i=1 mi = |E(Kn)| then Kn can be decomposed as an edge-disjoint union of closed trails of lengths m1, . . . , mt. This result was later generalized [Balister, to appear] to all sufficiently dense Eulerian graphs G in place of Kn. In this article we consider the corresponding questions for direc...
متن کاملArbitrary decompositions into open and closed trails
The problem of arbitrary decomposition of a graph G into closed trails i.e. a decomposition into closed trails of prescribed lengths summing up to the size of the graph G was first considered in the case of the complete graph G = Kn (for odd n) in connection with vertexdistinguishing coloring of the union of cycles. Next, the same problem was investigated for other families of graphs. In this p...
متن کاملDecomposing Complete Tripartite Graphs into Closed Trails of Arbitrary Lengths
The complete tripartite graph Kn,n,n has 3n 2 edges. For any collection of positive integers x1, x2, . . . , xm with m ∑ i=1 xi = 3n 2 and xi > 3 for 1 6 i 6 m, we exhibit an edge-disjoint decomposition of Kn,n,n into closed trails (circuits) of lengths x1, x2, . . . , xm.
متن کاملDecomposition of complete bipartite graphs into open trails
It has been showed in [4] that any bipartite graph Ka,b, where a, b are even is decomposable into closed trails of prescribed even lengths. In this article we consider the corresponding question for open trails. We prove a necessary and sufficient condition for graphs Ka,b to be decomposable into edge-disjoint open trails of positive lengths (less than ab) whenever these lengths sum up to the s...
متن کاملOn Planar Graphs Arbitrarily Decomposable into Closed Trails
A graph G is arbitrarily decomposable into closed trails (ADCT) if the following is true: Whenever (l1, . . . , lp) is a sequence of integers adding up to |E(G)| and there is a closed trail of length li in G for i = 1, . . . , p, then there is a sequence (T1, . . . , Tp) of pairwise edge-disjoint closed trails in G such that Ti is of length li for i = 1, . . . , p. In the paper it is proved tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 88 شماره
صفحات -
تاریخ انتشار 2003